Rapidly-Exploring Random Tree approach for Geometry Friends
نویسندگان
چکیده
Geometry Friends (GF) is a physics-based platform game, where players control one of two characters (a circle and a rectangle) through a series of both individual and cooperative levels. Each level is solved by retrieving a set of collectibles. This paper proposes an approach using Rapidly-exploring RandomTrees (RRTs) to find a solution for the individual levels of Geometry Friends. Solving a level of GF is divided into two subtasks: (1) planning the level; and (2) executing in real time the sequence ofmoves required to fulfill the plan. We use our RRT approach to solve (1) and a Proportional Integral Derivative (PID) controller to guide (2). The quality of the agent implemented was measured in the 2015 GF Game AI Competition. Results show that our agents are able to plan both public and private levels and are able to control their motion in order to finish most of them.
منابع مشابه
Adapting a Rapidly-Exploring Random Tree for Automated Planning
Rapidly-exploring random trees (RRTs) are data structures and search algorithms designed to be used in continuous path planning problems. They are one of the most successful state-of-the-art techniques as they offer a great degree of flexibility and reliability. However, their use in other search domains has not been thoroughly analyzed. In this work we propose the use of RRTs as a search algor...
متن کاملPotential functions based sampling heuristic for optimal path planning
Rapidly-exploring Random Tree Star(RRT*) is a recently proposed extension of Rapidly-exploring Random Tree (RRT) algorithm that provides a collisionfree, asymptotically optimal path regardless of obstacles geometry in a given environment. However, one of the limitation in the RRT* algorithm is slow convergence to optimal path solution. As a result it consumes high memory as well as time due to ...
متن کاملRobotic Path Planning using Rapidly exploring Random Trees
Rapidly exploring Random Tree (RRT) path planning methods provide feasible paths between a start and goal point in configuration spaces containing obstacles, sacrificing optimality (eg. Shortest path) for speed. The raw resultant paths are generally jagged and the cost of extending the tree can increase steeply as the number of existing branches grow. This paper provides details of a speed-up m...
متن کاملAn Optimized Algorithm Based on Random Tree and Particle Swarm
Received Aug 11, 2013 Revised Feb 20, 2014 Accepted Mar 10, 2014 A based on Rapidly-exploring Random Tree (RRT) and Particle Swarm Optimizer (PSO) for path planning of the robot is proposed. First the grid method is built to describe the working space of the mobile robot, then the Rapidly-exploring Random Tree algorithm is used to obtain the global navigation path, and the Particle Swarm Optimi...
متن کاملMotion Planning of Self-reconfigurable Modular Robots Using Rapidly Exploring Random Trees
Motion planning of self-reconfigurable robots in an environment is a challenging task. In this paper, we propose a sampling-based motion planning approach to plan locomotion of an organism with many degrees of freedom. The proposed approach is based on the Rapidly Exploring Random tree algorithm, which uses physical simulation to explore the configuration space of the highly articulated robots....
متن کامل